An Efficient Polynomial Pool - Based Scheme for Distributed Heterogeneous Wireless Sensor Networks

The Sinks are vivacious in many wireless sensor network (WSN) solicitations for competent data accumulation, confined sensor reprogramming, and for extricating and revoking conceded sensors. However, in sensor networks that make use of the temporal key dissemination schemes for pairwise key naissance and endorsement between sensor nodes and mobile sinks, the engross of mobile sinks for data assortment exalts a new reassurance challenge: in the basic probabilistic and q-composite key redistribution schemes, a mugger can easily procure a hefty number of keys by apprehending a small fraction of nodes, and hence, can gain control of the network by arraying a simulated mobile sink preloaded with some conceded keys. This critique designates a multifarious level general framework that authorities the use of any pair wise key redistribution scheme as its basic component. The new framework necessitates two separate key pools, one for the mobile sink to retrieve the network, and one for pair wise key disposition between the sensors. To auxiliary condense the reimbursements initiated by predetermined access node replication attacks; we have underwired the authentication mechanism between the sensor and the stationary access node in the propositioned framework. Through detailed analysis, we show that our security framework has sophisticated network resilience to a mobile sink replication attack as compared to the polynomial pool-based scheme.